A PROXIMAL POINT-TYPE ALGORITHM FOR PSEUDOMONOTONE EQUILIBRIUM PROBLEMS
نویسندگان
چکیده
منابع مشابه
Common solutions to pseudomonotone equilibrium problems
In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradient-cutting algorithm which is extended from the previously known one for variational inequalities to equilibrium problems. The second is a new cyclic hybrid extragradient-cutting algorithm....
متن کاملEquilibrium problems and fixed point problems for nonspreading-type mappings in hilbert space
In this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in Hilbert space. A strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. The main result of this paper extendthe results obtain...
متن کاملOn Equilibrium Problems Involving Strongly Pseudomonotone Bifunctions
We study equilibrium problems with strongly pseudomonotone bifunctions in real Hilbert spaces. We show the existence of a unique solution. We then propose a generalized strongly convergent projection method for equilibrium problems with strongly pseudomonotone bifunctions. The proposed method uses only one projection without requiring Lipschitz continuity. Application to variational inequalitie...
متن کاملStrong convergence of a proximal-type algorithm for an occasionally pseudomonotone operator in Banach spaces
It is known that the proximal point algorithm converges weakly to a zero of a maximal monotone operator, but it fails to converge strongly. Then, in (Math. Program. 87:189-202, 2000), Solodov and Svaiter introduced the new proximal-type algorithm to generate a strongly convergent sequence and established a convergence property for the algorithm in Hilbert spaces. Further, Kamimura and Takahashi...
متن کاملConvergence of a Proximal Point Algorithm for Solving Minimization Problems
We introduce and consider a proximal point algorithm for solving minimization problems using the technique of Güler. This proximal point algorithm is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic distance-like functions. It can be seen as an extragradient iterative scheme. We prove the convergence rate of this new proximal point method under mild a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2012
ISSN: 1015-8634
DOI: 10.4134/bkms.2012.49.4.749